Well-totally-dominated graphs
نویسندگان
چکیده
A subset of vertices in a graph is called total dominating set if every vertex the adjacent to at least one this set. minimal it does not properly contain another In paper, we study graphs whose all sets have same size, referred as well-totally-dominated (WTD) graphs. We first show that WTD with bounded domination number can be recognized polynomial time. Then focus on two. case, characterize triangle-free and packing two, there are only finitely many planar minimum degree three. Lastly, three then girth most 12. conclude several open questions.
منابع مشابه
Locally Well-Dominated and Locally Independent Well-Dominated Graphs
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e....
متن کاملWell-dominated graphs without cycles of lengths 4 and 5
Let G be a graph. A set S of vertices in G dominates the graph if every vertex of G is either in S or a neighbor of a vertex in S. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph G is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملTotally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . . , |V (G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total label...
متن کاملTotally equimatchable graphs
A subset X of vertices and edges of a graph G is totally matching if no two elements of X are adjacent or incident. In this paper we determine all graphs in which every maximal total matching is maximum.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2021
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2465.571